Geometric Characterization of Hereditarily Bijective Boolean Networks
نویسنده
چکیده
The study of relationships between structure and dynamics of asynchronous Boolean networks has recently led to the introduction of hereditarily bijective maps and even or odd self-dual networks. We show here that these two notions can be simply characterized geometrically: through orthogonality between certain affine subspaces. We also use this characterization to provide a construction of the class of hereditarily bijective maps, and to study its stability properties.
منابع مشابه
Local cycles and dynamical properties of Boolean networks
We investigate the relationships between the dynamical properties of Boolean networks and properties of their Jacobian matrices, in particular the existence of local cycles in the associated interaction graphs. We define the notion of hereditarily bijective maps, and we use it to strengthen the property of unicity of a fixed point and to provide simplified proofs and generalizations of theorems...
متن کاملA Heterogeneous Characterization of Subdirectly Irreducible Bijective Boolean Modules
We follow throughout a heterogeneous approach to present some characterizations (Theorem 3.5 and Theorem 3.35) of subdirectly irreducible bijective Boolean modules. The notions of essential element (as modular element) and [1]-closed element (as Boolean element) were implemented to this class of algebras. Our final aim of reaching the class of simple bijective Boolean modules, as a particular c...
متن کاملPractical Bijective S-box Design
Vectorial Boolean functions are usually called Substitution Boxes (S-Boxes) and are used as basic component of block ciphers in Cryptography. The ciphers that are Substitution-permutation networks use bijective S-Boxes i.e., Boolean permutations. S-Boxes with low differential uniformity and high nonlinearity are considered as cryptographically strong. In this paper we study some properties of S...
متن کاملA simple proof of the hereditary undecidability of the theory of lattice-ordered abelian groups
In 1967 Gurevich [3] published a proof that the class of divisible Axchimedean lat t ice-ordered abelian groups such that the lattice of carriers is an atomic Boolean algebra has a hereditarily undecidable first-order theory. (He essentially showed the reduct of this class to lattices has a hereditarily undecidable first-order theory: on p. 49 of his paper change z ~ u + v to z ~ u v v in the d...
متن کاملA Lower Bound for Boolean Permanent in Bijective Boolean Circuits and its Consequences
We identify a new restriction on Boolean circuits called bijectivity and prove that bijective Boolean circuits require exponential size to compute the Boolean permanent function. As consequences of this lower bound, we show exponential size lower bounds for: (a) computing the Boolean permanent using monotone multilinear circuits ; (b) computing the 0-1 permanent function using monotone arithmet...
متن کامل